Complexity of Multi-Value Byzantine Agreement
نویسندگان
چکیده
Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of the funding agencies or the U.S. government.
منابع مشابه
Short Note on Complexity of Multi-Value Byzantine Agreement
Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of the funding agencies or the U.S. government.
متن کاملFrom O(n) to O(n): An Efficient Deterministic Algorithm for Byzantine Agreement
In this paper, we introduce an efficient deterministic agreement algorithm that solves the multi-valued Byzantine agreement problem deterministically for networks of arbitrary size n ≥ 4 and up to t < n/3 failures. This paper considers the “broadcast” version of the agreement problem, wherein the goal is for the nodes in the network to agree on the values that a certain source node wants to bro...
متن کاملByzantine Preferential Voting
In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on pref...
متن کاملSimple Gradecast Based Algorithms
Gradecast is a simple three-round algorithm presented by Feldman and Micali. The current work presents a very simple synchronous algorithm that utilized Gradecast to achieve Byzantine agreement. Two small variations of the presented algorithm lead to improved algorithms for solving the Approximate agreement problem and the Multi-consensus problem. An optimal approximate agreement algorithm was ...
متن کاملEecient Byzantine Agreement Secure against General Adversaries ?
This paper presents protocols for Byzantine agreement, i.e. for reliable broadcast, among a set of n players, some of which may be controlled by an adversary. It is well-known that Byzantine agreement is possible if and only if the number of cheaters is less than n=3. In this paper we consider a general adversary that is speciied by a set of subsets of the player set (the adversary structure), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1006.2422 شماره
صفحات -
تاریخ انتشار 2010